1. Algebraic computability and enumeration models : recursion theory and descriptive complexity
پدیدآورنده : Nourani, Cyrus F.
کتابخانه: Library of Institute for Research in Fundamental Sciences (Tehran)
موضوع : ، Functor theory,، Model theory,، Computable functions,، Algebra, Homological,، Kleene algebra
رده :
QA
169
.
N68A4
2. Effective mathematics of the uncountable /
پدیدآورنده : edited by Noam Greenberg (Victoria University of Wellington), Joel David Hamkins (City University of New York), Denis Hirschfeldt (University of Chicago), Russell Miller (City University of New York).
کتابخانه: Center and Library of Islamic Studies in European Languages (Qom)
موضوع : Computable functions.,Model theory.
3. #Non-classical logics, model theory, and computability
پدیدآورنده : #edited by A. I. Arruda, N. C. A. da Costa, R. Chuaqui
کتابخانه: Central Library of Esfehan University of Technology (Esfahan)
موضوع : Nonclassical mathematical logic -- Congresses ،Model theory -- Congresses ،Computable functions -- Congresses
رده :
#
QA
،#.
L37
،#
1976
4. Non-classical logics, model theory, and computability: proceedings of the Third Latin-American Symposium on Mathematical Logic, Campinas, Brazil, July 11-17, 1976
پدیدآورنده : edited by A. I. Arruda, N. C. A. da Costa, R. Chuaqui
کتابخانه: Central Library and Documentation Center (Kerman)
موضوع : Congresses ، Nonclassical mathematical logic,Congresses ، Model theory,Congresses ، Computable functions
رده :
QA
9
.
7
.
L3
